Partial Proof Trees, Hybrid Logic, and Quantifier Scope

نویسندگان

  • Aravind K. Joshi
  • Seth Kulick
  • Natasha Kurtonina
چکیده

We argue that a fundamental theoretical difference between the resourcelogical and Minimalist frameworks is the computation of a semantic representation that can capture quantifier scope ambiguity. We discuss an approach to handling such data within the context of a system of categorial inference based on the use of hybrid logic to impose two different levels of composition, and suggest that this analysis can be seen as a ”middle-ground” between the resource-logical and Minimalist approaches. We believe that this makes a significant contribution to the investigation of the connections between the Minimalist and resource-logical frameworks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Deductive Account of Quantification in LFG

The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semantic interpretations can be expressed directly in a fragment of linear logic in a way that explains correctly the constrained interactions between quantifier scope ambiguity and bound anaphora. The use of a deductive framework to account for the compositional properties of ...

متن کامل

The proof theoretic approach to semantics “syntacticizes semantics”

The proof theoretic approach to semantics “syntacticizes semantics”. Generative syntax does something similar when it employs features and functional heads that correspond to semantic properties such as “definite”, “negative”, “distributive”, “topic”, “telic”, “evidential”, etc. In a paper that recasts Beghelli—Stowell’s 1997 theory of quantifier scope in minimalist terms, Stabler (1997) propos...

متن کامل

Similarity, Logic, and Games - Bridging Modeling Layers of Hybrid Systems

Specifications and implementations of complex physical systems tend to differ as low-level effects such as sampling are often ignored when highlevel models are created. Thus, the low-level models are often not exact refinements of the high-level specification. However, intuitively we would consider them as similar. To bridge the gap between these models, we study notions of similarity and robus...

متن کامل

The Grail theorem prover: Type theory for syntax and semantics

Type-logical grammars use a foundation of logic and type theory to model natural language. These grammars have been particularly successful giving an account of several well-known phenomena on the syntax-semantics interface, such as quantifier scope and its interaction with other phenomena. This chapter gives a highlevel description of a family of theorem provers designed for grammar developmen...

متن کامل

Weak MSO+U with Path Quantifiers over Infinite Trees

This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain automaton model, while emptiness for the automaton model is decided using profinite trees. This paper presents a logic over infinite trees with decidable sat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999